Cellular topology optimization on differentiable Voronoi diagrams
نویسندگان
چکیده
Cellular structures manifest their outstanding mechanical properties in many biological systems. One key challenge for designing and optimizing these geometrically complicated lies devising an effective geometric representation to characterize the system's spatially varying cellular evolution driven by objective sensitivities. A conventional discrete structure, e.g., a Voronoi diagram, whose relies on cells faces, lacks its differentiability facilitate large-scale, gradient-based topology optimizations. We propose optimization algorithm based differentiable generalized that can evolve structure as continuous field. The central piece of our method is hybrid particle-grid encode previously diagram into density field defined Euclidean space. Based this representation, we further extend it tackle anisotropic cells, free boundaries, functionally-graded structures. Our enables integration state-of-the-art pipelines, which defines novel design space explore options effectively were impractical previous approaches. showcase efficacy approach with up thousands including femur bone Odonata wing.
منابع مشابه
Voronoi Diagrams on the Sphere
Given a set of compact sites on a sphere, we show that their spherical Voronoi diagram can be computed by computing two planar Voronoi diagrams of suitably transformed sites in the plane. We also show that a planar furthest-site Voronoi diagram can always be obtained as a portion of a nearest-site Voronoi diagram of a set of transformed sites. Two immediate applications are an O(n logn) algorit...
متن کاملVoronoi diagrams on the spher
Given a set of compact sites on a sphere, we show that their spherical Voronoi diagram can be computed by computing two planar Voronoi diagrams of suitably transformed sites in the plane. We also show that a planar furthest-site Voronoi diagram can always be obtained as a portion of a nearest-site Voronoi diagram of a set of transformed sites. Two immediate applications are an O(n logn) algorit...
متن کاملLimits of Voronoi Diagrams
Dit proefschrift werd mede mogelijk gemaakt met financiële steun van de Nederlandse Organisatie voor Wetenschappelijk Onderzoek.
متن کاملFarthest-Polygon Voronoi Diagrams
Given a family of k disjoint connected polygonal sites in general position and of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the distance to a closest point on it. We show that the complexity of this diagram is O(n), and give an O(n log n) time algorithm to compute it. We also prove a number of structural properties of this ...
متن کاملOn the conversion of ordinary voronoi diagrams into laguerre diagrams
We present some geometric relationships between the ordinary Voronoi diagram, and the Voronoi diagram in the Laguerre geometry. We derive from these properties an algorithm for the conversion of ordinary Voronoi diagrams into Voronoi diagrams in the Laguerre geometry.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Numerical Methods in Engineering
سال: 2022
ISSN: ['0029-5981', '1097-0207']
DOI: https://doi.org/10.1002/nme.7121